<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>SYMMETRY: tree/binary_rep.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">SYMMETRY
   </div>
   <div id="projectbrief">C++LIBRARYFORSCIENTIFICCOMPUTATION</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('binary__rep_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Pages</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">binary_rep.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef BINARY_REP_H</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define BINARY_REP_H</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="preprocessor">#include &lt;functional&gt;</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;</div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="preprocessor">#include  &quot;tree_common.h&quot;</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="preprocessor">#include &quot;binary_tree_iter.h&quot;</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;</div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="keyword">namespace </span>tree</div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;{</div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00017"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html">   17</a></span>&#160;<span class="keyword">class </span><a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;{</div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keyword">private</span>:</div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    </div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keyword">typedef</span> <a class="code" href="structtree_1_1btree__node.html">btree_node&lt;T&gt;</a> <a class="code" href="structtree_1_1btree__node.html">node_type</a>;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keyword">typedef</span> <a class="code" href="classtree_1_1btree__iterator.html">btree_iterator&lt;T, node_type&gt;</a> <a class="code" href="classtree_1_1btree__iterator.html">iterator</a>;</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keyword">typedef</span> <a class="code" href="classtree_1_1btree__preorder__iterator.html">btree_preorder_iterator&lt;T, node_type &gt;</a> <a class="code" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a>;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keyword">typedef</span> <a class="code" href="classtree_1_1btree__inorder__iterator.html">btree_inorder_iterator&lt;T, node_type &gt;</a> <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a>;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">typedef</span> <a class="code" href="classtree_1_1btree__postorder__iterator.html">btree_postorder_iterator&lt;T, node_type &gt;</a> <a class="code" href="classtree_1_1btree__postorder__iterator.html">postorder_iterator</a>;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="keyword">protected</span>:  <span class="comment">//can&#39;t construct cBinaryRep object directly -- only through cBinaryTree</span></div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    <a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a>()</div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        :m_Root(<span class="keyword">nullptr</span>)</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    {};</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    ~<a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a>()</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    {};</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a> &amp;bin_rep)</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    {</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    };</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    </div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a>&amp; operator=(<span class="keyword">const</span> <a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a> &amp;bin_rep)</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    {</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="comment">//TODO</span></div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    };</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#a7a8f861470cb8538aa03ddbb9cbac6af">   52</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1cBinaryRep.html#a7a8f861470cb8538aa03ddbb9cbac6af">operator==</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1cBinaryRep.html">cBinaryRep</a>&amp; bin_rep)</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    {</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        std::stack&lt;node_type*&gt; this_stack;</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        std::stack&lt;node_type*&gt; other_stack;</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <a class="code" href="structtree_1_1btree__node.html">node_type</a> *current_this_node = this.m_Root;</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <a class="code" href="structtree_1_1btree__node.html">node_type</a> *current_other_node = bin_rep.m_Root;</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">while</span>(<span class="keyword">true</span>)</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        {</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            <span class="keywordflow">if</span>( (<span class="keyword">nullptr</span> != current_this_node) || (<span class="keyword">nullptr</span> != current_other_node) )</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            {</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;                <span class="keywordflow">if</span>( (<span class="keyword">nullptr</span> == current_other_node) || (<span class="keyword">nullptr</span> == current_this_node) )</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                this_stack.push(current_this_node);</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                other_stack.push(current_other_node);</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                current_this_node = current_this_node-&gt;left;</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;                current_other_node = current_other_node-&gt;left;</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;                <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            }</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;            <span class="keywordflow">if</span>(!this_stack.empty() || !other_stack.empty())</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            {</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                <span class="keywordflow">if</span>(other_stack.empty() || this_stack.empty())</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;                current_this_node = this_stack.top();</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                this_stack.pop();</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;                current_other_node = other_stack.top();</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;                other_stack.pop();</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                <span class="keywordflow">if</span>(current_this_node-&gt;data != current_other_node-&gt;data);</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;                current_this_node = current_this_node-&gt;right;</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;                current_other_node = current_other_node-&gt;right;</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;            }</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            <span class="keywordflow">else</span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            {</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;                    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;            }</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        }</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    };</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;</div>
<div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#a5701848a04cd825236bc125b33e376d8">   94</a></span>&#160;    <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a> <a class="code" href="classtree_1_1cBinaryRep.html#a5701848a04cd825236bc125b33e376d8">begin_inorder</a>()</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    {</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a> inorder_it(m_Root);</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        inorder_it++;</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="keywordflow">return</span> inorder_it;</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    };</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;</div>
<div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#a6e912be346d3626156df92eabecee012">  104</a></span>&#160;    <a class="code" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a> <a class="code" href="classtree_1_1cBinaryRep.html#a6e912be346d3626156df92eabecee012">begin_preorder</a>()</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    {</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <a class="code" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a> preorder_it(m_Root);</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        preorder_it++;</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        <span class="keywordflow">return</span> preorder_it;</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    };</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div>
<div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#a99f4029023bc6b07fade450aceb2f17d">  114</a></span>&#160;    <a class="code" href="classtree_1_1btree__postorder__iterator.html">postorder_iterator</a> <a class="code" href="classtree_1_1cBinaryRep.html#a99f4029023bc6b07fade450aceb2f17d">begin_postorder</a>()</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    {</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        <a class="code" href="classtree_1_1btree__postorder__iterator.html">postorder_iterator</a> postorder_it(m_Root);</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        postorder_it++;</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="keywordflow">return</span> postorder_it;</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    };</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div>
<div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#acf645e7e2447eb801c71ac752ecede22">  125</a></span>&#160;    <a class="code" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a> <a class="code" href="classtree_1_1cBinaryRep.html#acf645e7e2447eb801c71ac752ecede22">end</a>()</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    {</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a>();</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    };</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;</div>
<div class="line"><a name="l00133"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#a1bd7a582b25b1f7a4ff76ea936377458">  133</a></span>&#160;    <a class="code" href="classtree_1_1btree__iterator.html">iterator</a> <a class="code" href="classtree_1_1cBinaryRep.html#a1bd7a582b25b1f7a4ff76ea936377458">insertLeftChild</a>(<a class="code" href="classtree_1_1btree__iterator.html">iterator</a> iter, <span class="keyword">const</span> T&amp; data)</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    {</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> == iter.m_Current-&gt;left)</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        {</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;            iter.m_Current-&gt;left = <span class="keyword">new</span> <a class="code" href="structtree_1_1btree__node.html">node_type</a>(data);</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a>(iter.m_Current-&gt;left);</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;        }</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        {</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;            <a class="code" href="structtree_1_1btree__node.html">node_type</a> *node = iter.m_Current-&gt;left;</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;            iter.m_Current-&gt;left = <span class="keyword">new</span> <a class="code" href="structtree_1_1btree__node.html">node_type</a>(data);</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;            iter.m_Current-&gt;left-&gt;left = node;</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a>(iter.m_Current-&gt;left);</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        }</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;    };</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;</div>
<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#a593596cea8e60e85a0f66fb3354617a8">  152</a></span>&#160;    <a class="code" href="classtree_1_1btree__iterator.html">iterator</a> <a class="code" href="classtree_1_1cBinaryRep.html#a593596cea8e60e85a0f66fb3354617a8">insertRightChild</a>(<a class="code" href="classtree_1_1btree__iterator.html">iterator</a> iter, <span class="keyword">const</span> T&amp; data)</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;    {</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> == iter.m_Current-&gt;right)</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;        {</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;            iter.m_Current-&gt;right = <span class="keyword">new</span> <a class="code" href="structtree_1_1btree__node.html">node_type</a>(data);</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a>(iter.m_Current-&gt;right);</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;        }</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        {</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;            <a class="code" href="structtree_1_1btree__node.html">node_type</a> *node = iter.m_Current-&gt;right;</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;            iter.m_Current-&gt;right = <span class="keyword">new</span> <a class="code" href="structtree_1_1btree__node.html">node_type</a>(data);</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;            iter.m_Current-&gt;right-&gt;right = node;</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a>(iter.m_Current-&gt;right);</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        }</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;    };</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    iterator insertRoot(<span class="keyword">const</span> T&amp; data)</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    {</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        assert(<span class="keyword">nullptr</span> == m_Root);</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        m_Root = <span class="keyword">new</span> node_type(data);</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        inorder_iterator iter(m_Root);</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="keywordflow">return</span> iter;</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    };</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> FUNC&gt;</div>
<div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="classtree_1_1cBinaryRep.html#aebf973eb7334a5cf2134a51ebc519d33">  181</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classtree_1_1cBinaryRep.html#aebf973eb7334a5cf2134a51ebc519d33">traverse</a>(tree_traversal traversal, FUNC&amp; visit)</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    {</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;        <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> == m_Root)</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;cBinaryRep.traverse -- invalid root node&quot;</span>);</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;        <a class="code" href="structtree_1_1btree__node.html">node_type</a> *current_node = m_Root;</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        std::stack&lt;node_type*&gt; stack;</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        <span class="keywordflow">if</span>(INORDER == traversal)</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        {</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            <span class="keywordflow">while</span>(<span class="keyword">true</span>)</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;            {</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;                <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> != current_node)</div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                {</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                    stack.push(current_node);</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                    current_node = current_node-&gt;left;</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                    <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                }</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                <span class="keywordflow">if</span>(!stack.empty())</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                {</div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                    current_node = stack.top();</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                    stack.pop();</div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                    visit(current_node-&gt;data);</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                    current_node = current_node-&gt;right;</div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                }</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                    <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;            }</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;        }</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>(PREORDER == traversal)</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;        {</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;            stack.push(current_node);</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;            <span class="keywordflow">while</span>(!stack.empty())</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;            {</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                current_node = stack.top();</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                stack.pop();</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> != current_node-&gt;right)</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                    stack.push(current_node-&gt;right);</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;                <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> != current_node-&gt;left)</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;                    stack.push(current_node-&gt;left);</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;                visit(current_node-&gt;data);</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            }</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        }</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        {</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;            assert(POSTORDER == traversal);</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;            <span class="keywordflow">while</span>(<span class="keyword">true</span>)</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;            {</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> != current_node)</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                {</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                    <span class="keywordflow">if</span>(<span class="keyword">nullptr</span> != current_node-&gt;right)</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;                    {</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;                        stack.push(current_node-&gt;right);</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;                    }</div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                    stack.push(current_node);</div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                    current_node = current_node-&gt;left;</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                    <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                }</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;                <span class="keywordflow">if</span>(!stack.empty())</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                {</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;                    current_node = stack.top();</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;                    stack.pop();</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;                    <span class="keywordflow">if</span>( (<span class="keyword">nullptr</span> != current_node-&gt;right) &amp;&amp; !stack.empty() &amp;&amp; (stack.top() == current_node-&gt;right) )</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;                    {</div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;                        stack.pop();</div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;                        stack.push(current_node);</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;                        current_node = current_node-&gt;right;</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;                    }</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;                    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;                    {</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;                        visit(current_node-&gt;data);</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;                        current_node = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;                    }</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;                }</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;                {</div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;                    <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;                }</div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;            }</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        }</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;    };</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="keyword">private</span>:</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;    node_type *m_Root;</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;};</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;};<span class="comment">//namespace tree</span></div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;<span class="preprocessor"></span></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_aebf973eb7334a5cf2134a51ebc519d33"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#aebf973eb7334a5cf2134a51ebc519d33">tree::cBinaryRep::traverse</a></div><div class="ttdeci">void traverse(tree_traversal traversal, FUNC &amp;visit)</div><div class="ttdef"><b>Definition:</b> binary_rep.h:181</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_a5701848a04cd825236bc125b33e376d8"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#a5701848a04cd825236bc125b33e376d8">tree::cBinaryRep::begin_inorder</a></div><div class="ttdeci">inorder_iterator begin_inorder()</div><div class="ttdef"><b>Definition:</b> binary_rep.h:94</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_a1bd7a582b25b1f7a4ff76ea936377458"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#a1bd7a582b25b1f7a4ff76ea936377458">tree::cBinaryRep::insertLeftChild</a></div><div class="ttdeci">iterator insertLeftChild(iterator iter, const T &amp;data)</div><div class="ttdef"><b>Definition:</b> binary_rep.h:133</div></div>
<div class="ttc" id="classtree_1_1btree__iterator_html"><div class="ttname"><a href="classtree_1_1btree__iterator.html">tree::btree_iterator</a></div><div class="ttdef"><b>Definition:</b> binary_tree_iter.h:19</div></div>
<div class="ttc" id="classtree_1_1btree__preorder__iterator_html"><div class="ttname"><a href="classtree_1_1btree__preorder__iterator.html">tree::btree_preorder_iterator</a></div><div class="ttdef"><b>Definition:</b> binary_tree_iter.h:55</div></div>
<div class="ttc" id="structtree_1_1btree__node_html"><div class="ttname"><a href="structtree_1_1btree__node.html">tree::btree_node</a></div><div class="ttdef"><b>Definition:</b> tree_common.h:24</div></div>
<div class="ttc" id="classtree_1_1btree__inorder__iterator_html"><div class="ttname"><a href="classtree_1_1btree__inorder__iterator.html">tree::btree_inorder_iterator</a></div><div class="ttdef"><b>Definition:</b> binary_tree_iter.h:100</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_a6e912be346d3626156df92eabecee012"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#a6e912be346d3626156df92eabecee012">tree::cBinaryRep::begin_preorder</a></div><div class="ttdeci">preorder_iterator begin_preorder()</div><div class="ttdef"><b>Definition:</b> binary_rep.h:104</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_a7a8f861470cb8538aa03ddbb9cbac6af"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#a7a8f861470cb8538aa03ddbb9cbac6af">tree::cBinaryRep::operator==</a></div><div class="ttdeci">bool operator==(const cBinaryRep &amp;bin_rep)</div><div class="ttdef"><b>Definition:</b> binary_rep.h:52</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_acf645e7e2447eb801c71ac752ecede22"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#acf645e7e2447eb801c71ac752ecede22">tree::cBinaryRep::end</a></div><div class="ttdeci">preorder_iterator end()</div><div class="ttdef"><b>Definition:</b> binary_rep.h:125</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_a99f4029023bc6b07fade450aceb2f17d"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#a99f4029023bc6b07fade450aceb2f17d">tree::cBinaryRep::begin_postorder</a></div><div class="ttdeci">postorder_iterator begin_postorder()</div><div class="ttdef"><b>Definition:</b> binary_rep.h:114</div></div>
<div class="ttc" id="classtree_1_1btree__postorder__iterator_html"><div class="ttname"><a href="classtree_1_1btree__postorder__iterator.html">tree::btree_postorder_iterator</a></div><div class="ttdef"><b>Definition:</b> binary_tree_iter.h:142</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html_a593596cea8e60e85a0f66fb3354617a8"><div class="ttname"><a href="classtree_1_1cBinaryRep.html#a593596cea8e60e85a0f66fb3354617a8">tree::cBinaryRep::insertRightChild</a></div><div class="ttdeci">iterator insertRightChild(iterator iter, const T &amp;data)</div><div class="ttdef"><b>Definition:</b> binary_rep.h:152</div></div>
<div class="ttc" id="classtree_1_1cBinaryRep_html"><div class="ttname"><a href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a></div><div class="ttdef"><b>Definition:</b> binary_rep.h:17</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_70093cb3a9d1f8840af4e997fde867c3.html">tree</a></li><li class="navelem"><b>binary_rep.h</b></li>
    <li class="footer">Generated on Tue Feb 25 2014 17:11:52 for SYMMETRY by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
